Nuprl Lemma : es-prior-interface-vals_wf 11,40

es:ES, A:Type, X:AbsInterface(A), e:E. es-prior-interface-vals(es;X;e (A List) 
latex


Definitionses-prior-interface-vals(es;X;e), mapfilter(f;P;L), before(e), E(X), x.A(x), True, False, inl x , tt, inr x , ff, {x:AB(x)} , e  X, if b then t else f fi , case b of inl(x) => s(x) | inr(y) => t(y), X(e), t.1, E, let x,y = A in B(x;y), AbsInterface(A), ES, Top, P & Q, xt(x), first(e), pred(e), A, <ab>, x,yt(x;y), pred!(e;e'), , SWellFounded(R(x;y)), constant_function(f;A;B), b, , e < e', r  s, val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), , type List, Msg(M), kind(e), loc(e), Knd, kindcase(ka.f(a); l,t.g(l;t) ), EOrderAxioms(Epred?info), x:A  B(x), IdLnk, left + right, Unit, EqDecider(T), Type, P  Q, strong-subtype(A;B), , Id, f(a), a:A fp B(a), EState(T), x:AB(x), x:AB(x), t  T, s = t
Lemmassubtype rel wf, EState wf, Id wf, rationals wf, member wf, strongwellfounded wf, pred! wf, loc wf, not wf, assert wf, constant function wf, kindcase wf, Knd wf, top wf, bool wf, cless wf, qle wf, val-axiom wf, nat wf, unit wf, Msg wf, IdLnk wf, EOrderAxioms wf, deq wf, event system wf, es-interface-val wf, bfalse wf, btrue wf, es-interface wf, es-E wf, false wf, true wf, es-E-interface wf, es-interface-val wf2, es-is-interface wf, mapfilter wf, es-before wf

origin